Decidable Reasoning in a Fragment of the Epistemic Situation Calculus
نویسندگان
چکیده
The situation calculus is a popular formalism for reasoning about actions and change. Since the language is first-order, reasoning in the situation calculus is undecidable in general. An important question then is how to weaken reasoning in a principled way to guarantee decidability. Existing approaches either drastically limit the representation of the action theory or neglect important aspects such as sensing. In this paper we propose a model of limited belief for the epistemic situation calculus, which allows very expressive knowledge bases and handles both physical and sensing actions. The model builds on an existing approach to limited belief in the static case. We show that the resulting form of limited reasoning is sound with respect to the original epistemic situation calculus and eventually complete for a large class of formulas. Moreover, reasoning is decidable.
منابع مشابه
A Logic For Decidable Reasoning About Services
We consider a modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers. We mention several additional groups of axioms that need to be introduced to capture taxonomic reasoning. We show that the regression operator in this framework can be defined similarly to regression in the Reiter’s version of the situation ca...
متن کاملAdvanced Reasoning about Dynamical Systems
My research focuses on advanced reasoning about dynamical systems. We propose a modified fragment of the situation calculus that can assure decidable reasoning and has potential applications to Semantic Web services. Recently, we also develop a framework to handle large taxonomies of actions compactly, which allow us to gain computational advantages. Now, we consider another improvement to the ...
متن کاملThe Two-Variable Situation Calculus
We consider a modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers. We mention several additional groups of axioms that need to be introduced to capture taxonomic reasoning. We show that the regression operator in this framework can be defined similarly to regression in the Reiter’s version of the situation ca...
متن کاملBounded Epistemic Situation Calculus Theories
We define the class of e-bounded theories in the epistemic situation calculus, where the number of fluent atoms that the agent thinks may be true is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We show that for them verification of an expressive class of first-order μ-calculus temporal epistemic properties is decidable. We also show that ...
متن کاملTowards an Expressive Decidable Logical Action Theory
In the area of reasoning about actions, one of the key computational problems is the projection problem: to find whether a given logical formula is true after performing a sequence of actions. This problem is undecidable in the general situation calculus; however, it is decidable in some fragments. We consider a fragment P of the situation calculus and Reiter’s basic action theories (BAT) such ...
متن کامل